DECOMPOS: An Integrated System for Functional Decomposition

This paper presents a system for disjoint decompositions of logic functions with many inputs. It is a combination of three di erent methods: 1) Disjoint decompositions with a few bound set variables; 2) Disjoint bi-decompositions; and 3) Decompositions using Jacobian. 1) and 2) are quick, but nd only limited classes of decompositions, while 3) nds all disjoint decompositions by spending more time. We show the results of decompositions for more than four thousand functions. We also de ne a new class of functions: Completely bi-decomposable functions. Experimental results show that many practical logic functions have disjoint decompositions and some are completely bi-decomposable functions.